From LTL to unambiguous Büchi automata via disambiguation of alternating automata

Abstract Due to the high complexity of translating linear temporal logic (LTL) deterministic automata, several forms “restricted” nondeterminism have been considered with aim maintaining some benefits while at same time allowing more efficient translations from LTL. One them is notion unambiguity . This paper proposes a new algorithm for generation unambiguous Büchi automata (UBA) LTL formulas. Unlike other approaches it based on known translation very weak alternating (VWAA) NBA. A introduced and shown that VWAA-to-NBA preserves unambiguity. Checking VWAA determined be PSPACE-complete, both explicit symbolic encodings automata. The core LTL-to-UBA an iterative disambiguation procedure VWAA. Several heuristics are different stages procedure. We report implementation our approach in tool compare existing set. Our experiments cover model checking Markov chains, which important application UBA.